Information-theoretic Complexity of Program Specifications
نویسندگان
چکیده
منابع مشابه
Information-theoretic computation complexity
This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an informationtheoretic version of Giidel’s theorem on the limitations of...
متن کاملInformation-Theoretic Computational Complexity
This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an information-theoretic version of Gödel's theorem on the limitations of...
متن کاملNetwork Complexity Measures. an Information-theoretic Approach
Quantitative graph analysis by using structural indices has been intricate in a sense that it often remains unclear which structural graph measures is the most suitable one, see [1, 12, 13]. In general, quantitative graph analysis deals with quantifying structural information of networks by using a measurement approach [5]. As special problem thereof is to characterize a graph quantitatively, t...
متن کاملAn Information-Theoretic Framework for Image Complexity
In this paper, we introduce a new information-theoretic approach to study the complexity of an image. The new framework we present here is based on considering the information channel that goes from the histogram to the regions of the partitioned image, maximizing the mutual information. Image complexity has been related to the entropy of the image intensity histogram. This disregards the spati...
متن کاملComplexity and Information-theoretic Approaches to Biology
Notions of information and/or complexity have been applied to the analysis of a broad spectrum of biologically relevant problems, such as protein structure prediction, DNA motif discovery and compression, and neural spike trainsa. These notions have been studied by Kolmogorov (1965) and Chaitin (1966), with Solomono (1964), Wallace (1968) and Rissanen (1978) applying these to problems of statis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1987
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/30.3.223